Resolvability in Subdivision Graph of Circulant Graphs

Circulant networks are a very important and widely studied class of graphs due to their interesting diverse applications in networking, facility location problems, symmetric properties. The structure the graph ensures that it is about any line cuts into two equal parts. Due this behavior, resolvability these becomes interning. Subdividing an edge means inserting new vertex on divides edges. subdivision G formed by series subdivisions. In graph, resolving set uniquely identifies each its distance from other vertices. A metric basis minimum cardinality, number elements referred as dimension. This paper determines for Hl[1,k] constructed circulant Cl[1,k] subdividing We also proved that, k=2,3, has constant